4.30/4.35	% Problem    : Vampire---4.8_5743 : TPTP v0.0.0. Released v0.0.0.
4.30/4.36	% Command    : run_E %s %d THM
4.35/4.56	% Computer : n026.cluster.edu
4.35/4.56	% Model    : x86_64 x86_64
4.35/4.56	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
4.35/4.56	% Memory   : 8042.1875MB
4.35/4.56	% OS       : Linux 3.10.0-693.el7.x86_64
4.35/4.56	% CPULimit   : 1440
4.35/4.56	% WCLimit    : 180
4.35/4.56	% DateTime   : Mon Jul  3 13:16:57 EDT 2023
4.35/4.56	% CPUTime    : 
7.14/7.31	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.aNtS0ucIOh/Vampire---4.8_5743
7.14/7.31	# Version: 3.1pre001-ho
66.40/23.07	# partial match(2): HMLMSMSMSSLCHFA
66.40/23.07	# Preprocessing class: HMLLSMLMSSLCHFA.
66.40/23.07	# Scheduled 4 strats onto 8 cores with 179 seconds (1432 total)
66.40/23.07	# Starting new_ho_10 with 895s (5) cores
66.40/23.07	# Starting sh5l with 179s (1) cores
66.40/23.07	# Starting new_bool_1 with 179s (1) cores
66.40/23.07	# Starting new_bool_2 with 179s (1) cores
66.40/23.07	# new_bool_2 with pid 5924 completed with status 0
66.40/23.07	# Result found by new_bool_2
66.40/23.07	# partial match(2): HMLMSMSMSSLCHFA
66.40/23.07	# Preprocessing class: HMLLSMLMSSLCHFA.
66.40/23.07	# Scheduled 4 strats onto 8 cores with 179 seconds (1432 total)
66.40/23.07	# Starting new_ho_10 with 895s (5) cores
66.40/23.07	# Starting sh5l with 179s (1) cores
66.40/23.07	# Starting new_bool_1 with 179s (1) cores
66.40/23.07	# Starting new_bool_2 with 179s (1) cores
66.40/23.07	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
66.40/23.07	# Search class: HGHSM-SMLM32-DHFFFSBN
66.40/23.07	# Scheduled 5 strats onto 1 cores with 178 seconds (178 total)
66.40/23.07	# Starting new_ho_10 with 107s (1) cores
66.40/23.07	# new_ho_10 with pid 5925 completed with status 0
66.40/23.07	# Result found by new_ho_10
66.40/23.07	# partial match(2): HMLMSMSMSSLCHFA
66.40/23.07	# Preprocessing class: HMLLSMLMSSLCHFA.
66.40/23.07	# Scheduled 4 strats onto 8 cores with 179 seconds (1432 total)
66.40/23.07	# Starting new_ho_10 with 895s (5) cores
66.40/23.07	# Starting sh5l with 179s (1) cores
66.40/23.07	# Starting new_bool_1 with 179s (1) cores
66.40/23.07	# Starting new_bool_2 with 179s (1) cores
66.40/23.07	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
66.40/23.07	# Search class: HGHSM-SMLM32-DHFFFSBN
66.40/23.07	# Scheduled 5 strats onto 1 cores with 178 seconds (178 total)
66.40/23.07	# Starting new_ho_10 with 107s (1) cores
66.40/23.07	# Preprocessing time       : 0.247 s
66.40/23.07	# Presaturation interreduction done
66.40/23.07	
66.40/23.07	# Proof found!
66.40/23.07	# SZS status Theorem
66.40/23.07	# SZS output start CNFRefutation
66.40/23.07	thf(decl_318, type, one_one_nat: nat).
66.40/23.07	thf(decl_565, type, suc: nat > nat).
66.40/23.07	thf(decl_629, type, bit0: num > num).
66.40/23.07	thf(decl_631, type, one: num).
66.40/23.07	thf(decl_639, type, numeral_numeral_nat: num > nat).
66.40/23.07	thf(decl_679, type, ord_less_nat: nat > nat > $o).
66.40/23.07	thf(decl_694, type, ord_less_eq_nat: nat > nat > $o).
66.40/23.07	thf(decl_742, type, power_power_nat: nat > nat > nat).
66.40/23.07	thf(decl_1087, type, deg: nat).
66.40/23.07	thf(decl_1089, type, ma: nat).
66.40/23.07	thf(decl_1090, type, mi: nat).
66.40/23.07	thf(decl_1094, type, x: nat).
66.40/23.07	thf(fact_472_order__less__imp__triv, axiom, ![X731:nat, X732:nat, X733:$o]:((((ord_less_nat @ X732 @ X731)=>(X733))<=(ord_less_nat @ X731 @ X732))), file('/export/starexec/sandbox/tmp/tmp.aNtS0ucIOh/Vampire---4.8_5743', fact_472_order__less__imp__triv)).
66.40/23.07	thf(fact_602_dual__order_Ostrict__trans1, axiom, ![X7222:nat, X7223:nat, X7224:nat]:((((ord_less_nat @ X7224 @ X7223)<=(ord_less_nat @ X7224 @ X7222))<=(ord_less_eq_nat @ X7222 @ X7223))), file('/export/starexec/sandbox/tmp/tmp.aNtS0ucIOh/Vampire---4.8_5743', fact_602_dual__order_Ostrict__trans1)).
66.40/23.07	thf(fact_1__C5_Ohyps_C_I8_J, axiom, (ord_less_nat @ ma @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), file('/export/starexec/sandbox/tmp/tmp.aNtS0ucIOh/Vampire---4.8_5743', fact_1__C5_Ohyps_C_I8_J)).
66.40/23.07	thf(fact_2973_Suc__1, axiom, ((suc @ one_one_nat)=(numeral_numeral_nat @ (bit0 @ one))), file('/export/starexec/sandbox/tmp/tmp.aNtS0ucIOh/Vampire---4.8_5743', fact_2973_Suc__1)).
66.40/23.07	thf(fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062, axiom, ((ord_less_eq_nat @ mi @ x)&(ord_less_eq_nat @ x @ ma)), file('/export/starexec/sandbox/tmp/tmp.aNtS0ucIOh/Vampire---4.8_5743', fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062)).
66.40/23.07	thf(fact_501_linorder__neqE__nat, axiom, ![X1769:nat, X1770:nat]:((((X1769)!=(X1770))=>(~((ord_less_nat @ X1769 @ X1770))=>(ord_less_nat @ X1770 @ X1769)))), file('/export/starexec/sandbox/tmp/tmp.aNtS0ucIOh/Vampire---4.8_5743', fact_501_linorder__neqE__nat)).
66.40/23.07	thf(conj_0, conjecture, (ord_less_nat @ x @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), file('/export/starexec/sandbox/tmp/tmp.aNtS0ucIOh/Vampire---4.8_5743', conj_0)).
66.40/23.07	thf(fact_648_linorder__not__less, axiom, ![X2077:nat, X2078:nat]:((~((ord_less_nat @ X2077 @ X2078))<=>(ord_less_eq_nat @ X2078 @ X2077))), file('/export/starexec/sandbox/tmp/tmp.aNtS0ucIOh/Vampire---4.8_5743', fact_648_linorder__not__less)).
66.40/23.07	thf(c_0_8, plain, ![X731:nat, X732:nat, X733:$o]:(((ord_less_nat @ X731 @ X732)=>((ord_less_nat @ X732 @ X731)=>(X733)))), inference(fof_simplification,[status(thm)],[fact_472_order__less__imp__triv])).
66.40/23.07	thf(c_0_9, plain, ![X7222:nat, X7223:nat, X7224:nat]:(((ord_less_eq_nat @ X7222 @ X7223)=>((ord_less_nat @ X7224 @ X7222)=>(ord_less_nat @ X7224 @ X7223)))), inference(fof_simplification,[status(thm)],[fact_602_dual__order_Ostrict__trans1])).
66.40/23.07	thf(c_0_10, plain, ![X26525:nat, X26526:nat, X26527:$o]:((~(ord_less_nat @ X26525 @ X26526)|(~(ord_less_nat @ X26526 @ X26525)|(X26527)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])).
66.40/23.07	thf(c_0_11, plain, (ord_less_nat @ ma @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), inference(split_conjunct,[status(thm)],[fact_1__C5_Ohyps_C_I8_J])).
66.40/23.07	thf(c_0_12, plain, ((suc @ one_one_nat)=(numeral_numeral_nat @ (bit0 @ one))), inference(split_conjunct,[status(thm)],[fact_2973_Suc__1])).
66.40/23.07	thf(c_0_13, plain, ![X26681:nat, X26682:nat, X26683:nat]:((~(ord_less_eq_nat @ X26681 @ X26682)|(~(ord_less_nat @ X26683 @ X26681)|(ord_less_nat @ X26683 @ X26682)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
66.40/23.07	thf(c_0_14, plain, ![X12:nat, X11:nat]:((~((ord_less_nat @ X11 @ X12))|~((ord_less_nat @ X12 @ X11)))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_10])])])).
66.40/23.07	thf(c_0_15, plain, (ord_less_nat @ ma @ (power_power_nat @ (suc @ one_one_nat) @ deg)), inference(rw,[status(thm)],[c_0_11, c_0_12])).
66.40/23.07	thf(c_0_16, plain, ![X13:nat, X12:nat, X11:nat]:(((ord_less_nat @ X13 @ X12)|~((ord_less_eq_nat @ X11 @ X12))|~((ord_less_nat @ X13 @ X11)))), inference(split_conjunct,[status(thm)],[c_0_13])).
66.40/23.07	thf(c_0_17, plain, (ord_less_eq_nat @ x @ ma), inference(split_conjunct,[status(thm)],[fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062])).
66.40/23.07	thf(c_0_18, plain, ![X1769:nat, X1770:nat]:((((X1769)!=(X1770))=>(~(ord_less_nat @ X1769 @ X1770)=>(ord_less_nat @ X1770 @ X1769)))), inference(fof_simplification,[status(thm)],[fact_501_linorder__neqE__nat])).
66.40/23.07	thf(c_0_19, negated_conjecture, ~(ord_less_nat @ x @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
66.40/23.07	thf(c_0_20, plain, ![X2077:nat, X2078:nat]:((~(ord_less_nat @ X2077 @ X2078)<=>(ord_less_eq_nat @ X2078 @ X2077))), inference(fof_simplification,[status(thm)],[fact_648_linorder__not__less])).
66.40/23.07	thf(c_0_21, plain, ~((ord_less_nat @ (power_power_nat @ (suc @ one_one_nat) @ deg) @ ma)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
66.40/23.07	thf(c_0_22, plain, ![X11:nat]:(((ord_less_nat @ X11 @ ma)|~((ord_less_nat @ X11 @ x)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
66.40/23.07	thf(c_0_23, plain, ![X26533:nat, X26534:nat]:((((X26533)=(X26534))|((ord_less_nat @ X26533 @ X26534)|(ord_less_nat @ X26534 @ X26533)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])).
66.40/23.07	thf(c_0_24, negated_conjecture, ~((ord_less_nat @ x @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg))), inference(split_conjunct,[status(thm)],[c_0_19])).
66.40/23.07	thf(c_0_25, plain, ![X26538:nat, X26539:nat]:((((ord_less_nat @ X26538 @ X26539)|(ord_less_eq_nat @ X26539 @ X26538))&(~(ord_less_eq_nat @ X26539 @ X26538)|~(ord_less_nat @ X26538 @ X26539)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])).
66.40/23.07	thf(c_0_26, plain, ~((ord_less_nat @ (power_power_nat @ (suc @ one_one_nat) @ deg) @ x)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
66.40/23.07	thf(c_0_27, plain, ![X12:nat, X11:nat]:((((X11)=(X12))|(ord_less_nat @ X11 @ X12)|(ord_less_nat @ X12 @ X11))), inference(split_conjunct,[status(thm)],[c_0_23])).
66.40/23.07	thf(c_0_28, negated_conjecture, ~((ord_less_nat @ x @ (power_power_nat @ (suc @ one_one_nat) @ deg))), inference(rw,[status(thm)],[c_0_24, c_0_12])).
66.40/23.07	thf(c_0_29, plain, ![X12:nat, X11:nat]:((~((ord_less_eq_nat @ X11 @ X12))|~((ord_less_nat @ X12 @ X11)))), inference(split_conjunct,[status(thm)],[c_0_25])).
66.40/23.07	thf(c_0_30, plain, ((power_power_nat @ (suc @ one_one_nat) @ deg)=(x)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])).
66.40/23.07	thf(c_0_31, plain, ~((ord_less_nat @ ma @ x)), inference(spm,[status(thm)],[c_0_29, c_0_17])).
66.40/23.07	thf(c_0_32, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_30]), c_0_31]), ['proof']).
66.40/23.07	# SZS output end CNFRefutation
66.40/23.07	# Parsed axioms                        : 11424
66.40/23.07	# Removed by relevancy pruning/SinE    : 7988
66.40/23.07	# Initial clauses                      : 8965
66.40/23.07	# Removed in clause preprocessing      : 1956
66.40/23.07	# Initial clauses in saturation        : 7009
66.40/23.07	# Processed clauses                    : 12938
66.40/23.07	# ...of these trivial                  : 325
66.40/23.07	# ...subsumed                          : 3268
66.40/23.07	# ...remaining for further processing  : 9345
66.40/23.07	# Other redundant clauses eliminated   : 2064
66.40/23.07	# Clauses deleted for lack of memory   : 0
66.40/23.07	# Backward-subsumed                    : 74
66.40/23.07	# Backward-rewritten                   : 120
66.40/23.07	# Generated clauses                    : 80136
66.40/23.07	# ...of the previous two non-redundant : 67887
66.40/23.07	# ...aggressively subsumed             : 0
66.40/23.07	# Contextual simplify-reflections      : 99
66.40/23.07	# Paramodulations                      : 77996
66.40/23.07	# Factorizations                       : 14
66.40/23.07	# NegExts                              : 0
66.40/23.07	# Equation resolutions                 : 2123
66.40/23.07	# Total rewrite steps                  : 32745
66.40/23.07	# Propositional unsat checks           : 0
66.40/23.07	#    Propositional check models        : 0
66.40/23.07	#    Propositional check unsatisfiable : 0
66.40/23.07	#    Propositional clauses             : 0
66.40/23.07	#    Propositional clauses after purity: 0
66.40/23.07	#    Propositional unsat core size     : 0
66.40/23.07	#    Propositional preprocessing time  : 0.000
66.40/23.07	#    Propositional encoding time       : 0.000
66.40/23.07	#    Propositional solver time         : 0.000
66.40/23.07	#    Success case prop preproc time    : 0.000
66.40/23.07	#    Success case prop encoding time   : 0.000
66.40/23.07	#    Success case prop solver time     : 0.000
66.40/23.07	# Current number of processed clauses  : 3285
66.40/23.07	#    Positive orientable unit clauses  : 816
66.40/23.07	#    Positive unorientable unit clauses: 42
66.40/23.07	#    Negative unit clauses             : 314
66.40/23.07	#    Non-unit-clauses                  : 2113
66.40/23.07	# Current number of unprocessed clauses: 66611
66.40/23.07	# ...number of literals in the above   : 187279
66.40/23.07	# Current number of archived formulas  : 0
66.40/23.07	# Current number of archived clauses   : 5012
66.40/23.07	# Clause-clause subsumption calls (NU) : 18222456
66.40/23.07	# Rec. Clause-clause subsumption calls : 2471755
66.40/23.07	# Non-unit clause-clause subsumptions  : 1868
66.40/23.07	# Unit Clause-clause subsumption calls : 194476
66.40/23.07	# Rewrite failures with RHS unbound    : 0
66.40/23.07	# BW rewrite match attempts            : 1643
66.40/23.07	# BW rewrite match successes           : 539
66.40/23.07	# Condensation attempts                : 12938
66.40/23.07	# Condensation successes               : 51
66.40/23.07	# Termbank termtop insertions          : 3791546
66.40/23.07	
66.40/23.07	# -------------------------------------------------
66.40/23.07	# User time                : 14.351 s
66.40/23.07	# System time              : 0.174 s
66.40/23.07	# Total time               : 14.524 s
66.40/23.07	# Maximum resident set size: 48600 pages
66.56/23.17	
66.56/23.17	# -------------------------------------------------
66.56/23.17	# User time                : 15.526 s
66.56/23.17	# System time              : 0.211 s
66.56/23.17	# Total time               : 15.737 s
66.56/23.17	# Maximum resident set size: 27448 pages
66.56/23.17	% E---3.1 exiting
66.56/23.17	EOF
